the aim of this paper is to prove some common fixed point theorems for four  mappings satisfying $(psi,varphi)$-weak contractions involving rational expressions in ordered partial metric spaces. our results extend, generalize and improve some well-known results in the literature. also, we give two examples to illustrate our results.

A graph is said to be well-dominated if all its minimal dominating sets are of the same size. In this work, we introduce the notion of an irreducible dominating set, a variant of dominating set generalizing both minimal dominating sets and minimal total dominating sets. Based on this notion, we characterize the family of minimal dominating sets in a lexicographic product of two graphs and deriv...

Abstract The main purpose of this paper is to present some fixed-point results for a pair fuzzy dominated mappings which are generalized V -contractions in modular-like metric spaces. Some theorems using partial order discussed and also useful graphic contractions fuzzy-graph developed. To explain the validity our results, 2D 3D graphs have been constructed. Also, applications provided show nov...

In a series of four papers we determine structures whose existence is dual, in the sense complementary, to stars or combs. Here, second paper series, present duality theorems for combinations and combs: dominating dominated As exist if only combs do, complementary them coincide. Like arbitrary combs, our (and stars) are phrased terms normal trees tree-decompositions. The provide unify those all...

The aim of this paper is to prove some common fixed point theorems for four  mappings satisfying $(psi,varphi)$-weak contractions involving rational expressions in ordered partial metric spaces. Our results extend, generalize and improve some well-known results in the literature. Also, we give two examples to illustrate our results.

The aim of this paper is to prove some common fixed point theorems for four  mappings satisfying $(psi,varphi)$-weak contractions involving rational expressions in ordered partial metric spaces. Our results extend, generalize and improve some well-known results in the literature. Also, we give two examples to illustrate our results.

Let G be a digraph. A set S ⊆ V (G) is called an efficient total dominating set if the set of open out-neighborhoods N−(v) ∈ S is a partition of V (G). We say that G is efficiently open-dominated if both G and its reverse digraph G− have an efficient total dominating set. Some properties of efficiently open dominated digraphs are presented. Special attention is given to tournaments and directed...

Locating and Total Dominating Sets in Trees by Jamie Marie Howard A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.

We generalize some results of Borwein, Burke, Lewis, and Wang to mappings with values in metric (resp. ordered normed linear) spaces. We define two classes of monotone mappings between an ordered linear space and a metric space (resp. ordered linear space): K-monotone dominated and coneto-cone monotone mappings. K-monotone dominated mappings naturally generalize mappings with finite variation (...